A linear algorithm for renaming a set of clauses as a Horn set
نویسندگان
چکیده
منابع مشابه
A Horn Clause that Implies and Undecidable Set of Horn Clauses
In this paper we prove that there exists a Horn clause H such that the problem: given a Horn clause G. Is G a consequence of H ? is not recursive. Equivalently, there exists a one-clause PROLOG program such that there is no PROLOG implementation answering TRUE if the program implies a given goal and FALSE otherwise. We give a short survey of earlier results concerning clause implication and pro...
متن کاملA New Robust Bootstrap Algorithm for the Assessment of Common Set of Weights in Performance Analysis
The performance of the units is defined as the ratio of the weighted sum of outputs to the weighted sum of inputs. These weights can be determined by data envelopment analysis (DEA) models. The inputs and outputs of the related (Decision Making Unit) DMU are assessed by a set of the weights obtained via DEA for each DMU. In addition, the weights are not generally common, but rather, they are ve...
متن کاملDetermining a common set of weights in DEA by solving a linear programming
In models of Data Envelopment Analysis (DEA), an optimal set of input and output weights is generally as-sumed to represent the assessed Decision Making Unit (DMU) in the best light in comparison to all the other DMUs. These sets of weights are, typically, different for each of the participating DMUs. Thus, it is important to find a Common Set of Weights (CSW) across the set of DMUs. In this pa...
متن کاملA RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT
In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.
متن کاملSolving non-linear Horn clauses using a linear solver
Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90015-9